
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 2139. -- road -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>2139: road</h2><span class=green>Time Limit: </span>10 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>259 MB<br><span class=green>Submit: </span>21&nbsp;&nbsp;<span class=green>Solved: </span>14<br>[<a href='submitpage.php?id=2139'>Submit</a>][<a href='problemstatus.php?id=2139'>Status</a>][<a href='bbs.php?id=2139'>Discuss</a>]</center><h2>Description</h2><div class=content><p>很久很久以前，中原地区分成了N个国家，编号为1到N，任意两个国家都可互达。每个国家有一个攻击值A[i]和防御值B[i]。定义一个人从i国去j国的危险值为：假如A[i]&gt;B[j]，则危险值为( - )，否则危险值为0。现在，Nan从国家1出发，经过每一个国家有且仅有一次，最后回到国家1，要求找出一种方案，使得其中危险值的最大值最小。</p></div><h2>Input</h2><div class=content><p>第一行正整数N，表示有N个国家；第二行正整数A[1],A[2],x,y,z，有等式A[i]=(x*A[i-1]+y*A[i-2]+z)mod 32767；第三行正整数B[1],B[2],x,y,z，有等式B[i]=(x*B[i-1]+y*B[i-2]+z)mod 32767。</p></div><h2>Output</h2><div class=content><p>输出一个数,表示危险值的最大值最小是多少。</p></div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>5<br />
2 4 1231 4432 123<br />
123 45 3245 555 6676 <br />
</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>9171832<br />
【样例说明】<br />
A数组为2,4,13911,5151,3031 <br />
B数据为123,45,24364,26060,21765 <br />
其中一种最优方案为1- 2- 4- 3- 5-1，危险值分别为0,0,0,0,9171832<br />
<br />
【数据范围】<br />
100%  N<=1000000<br />
</span></div><h2>HINT</h2>
			<div class=content><p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search=By 梁健楠'>By 梁健楠</a></p></div><center>[<a href='submitpage.php?id=2139'>Submit</a>][<a href='problemstatus.php?id=2139'>Status</a>][<a href='bbs.php?id=2139'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
